A Note on Admissible Sampling Designs for a Finite Population
نویسندگان
چکیده
منابع مشابه
A Direct Bootstrap Method for Complex Sampling Designs From a Finite Population
In complex designs, classical bootstrap methods result in a biased variance estimator when the sampling design is not taken into account. Resampled units are usually rescaled or weighted in order to achieve unbiasedness in the linear case. In the present article, we propose novel resampling methods that may be directly applied to variance estimation. These methods consist of selecting subsample...
متن کاملHorvitz-Thompson estimator of population mean under inverse sampling designs
Inverse sampling design is generally considered to be appropriate technique when the population is divided into two subpopulations, one of which contains only few units. In this paper, we derive the Horvitz-Thompson estimator for the population mean under inverse sampling designs, where subpopulation sizes are known. We then introduce an alternative unbiased estimator, corresponding to post-st...
متن کاملa note on finite c-tidy groups
let $g$ be a group and $x in g$. the cyclicizer of $x$ is defined to be the subset $cyc(x)=lbrace y in g mid langle x, yrangle ; {rm is ; cyclic} rbrace$. $g$ is said to be a tidy group if $cyc(x)$ is a subgroup for all $x in g$. we call $g$ to be a c-tidy group if $cyc(x)$ is a cyclic subgroup for all $x in g setminus k(g)$, where $k(g)$ is the intersection of all the cyclicizers in ...
متن کاملA Note on Absolute Central Automorphisms of Finite $p$-Groups
Let $G$ be a finite group. The automorphism $sigma$ of a group $G$ is said to be an absolute central automorphism, if for all $xin G$, $x^{-1}x^{sigma}in L(G)$, where $L(G)$ be the absolute centre of $G$. In this paper, we study some properties of absolute central automorphisms of a given finite $p$-group.
متن کاملa note on the power graph of a finite group
suppose $gamma$ is a graph with $v(gamma) = { 1,2, cdots, p}$and $ mathcal{f} = {gamma_1,cdots, gamma_p} $ is a family ofgraphs such that $n_j = |v(gamma_j)|$, $1 leq j leq p$. define$lambda = gamma[gamma_1,cdots, gamma_p]$ to be a graph withvertex set $ v(lambda)=bigcup_{j=1}^pv(gamma_j)$ and edge set$e(lambda)=big(bigcup_{j=1}^pe(gamma_j)big)cupbig(bigcup_{ijine(gamma)}{uv;uin v(gamma_i),vin ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1971
ISSN: 0003-4851
DOI: 10.1214/aoms/1177693253